翻訳と辞書 Words near each other ・ Longer ・ Longer Fuse ・ Longer Heavier Vehicle ・ Longer Views ・ Longerak ・ Longerakvatnet ・ Longerhouw ・ Longeron ・ Longes ・ Longessaigne ・ Longest alternating subsequence ・ Longest bar in Australia ・ Longest bridge ・ Longest climbing salamander ・ Longest common subsequence problem ・ Longest common substring problem ・ Longest Day ・ Longest Day of Nelson ・ Longest element of a Coxeter group ・ Longest English sentence ・ Longest fence in the world ・ Longest increasing subsequence ・ Longest linear sequence ・ Longest NCAA Division I football winning streaks ・ Longest Night ・ Longest Night Service ・ Longest palindromic substring ・ Longest path problem ・ Longest prefix match ・ Longest professional baseball game Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Longest common substring problem ： ウィキペディア英語版 Longest common substring problem In computer science, the longest common substring problem is to find the longest string (or strings) that is a substring (or are substrings) of two or more strings. ==Example== The longest common substring of the strings "ABABC", "BABCA" and "ABCBA" is string "ABC" of length 3. Other common substrings are "A", "AB", "B", "BA", "BC" and "C". ABABC ||| BABCA ||| ABCBA 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Longest common substring problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.